From Well Structured Transition Systems to Program Verification

Well-structured transition systems everywhere!

Unfolding Concurrent Well-Structured Transition Systems

Our main objective is to combine partial-order methods with verification techniques for infinite-state systems in order to obtain efficient verification algorithms for concurrent infinite-state systems. Partial-order methods are commonly used in the analysis of finite systems consisting of many parallel components. In this paper we propose an extension of these methods to parallel compositions ...

Well Structured Transition Systems with History

We propose a formal model of concurrent systems in which the history of a computation is explicitly represented as a collection of events that provide a view of a sequence of configurations. In our model events generated by transitions become part of the system configurations leading to operational semantics with historical data. This model allows us to formalize what is usually done in symboli...

Handling infinitely branching well-structured transition systems

Most decidability results concerning well-structured transition systems apply to the finitely branching variant. Yet some models (inserting automata, ωPetri nets, . . . ) are naturally infinitely branching. Here we develop tools to handle infinitely branching WSTS by exploiting the crucial property that in the (ideal) completion of a well-quasi-ordered set, downward-closed sets are finite union...

Regular Separability of Well Structured Transition Systems

We investigate languages recognized by well structured transition systems (WSTS) with upward (resp. downward) compatibility. We show that under mild assumptions every two disjoint WSTS languages are regular separable, i.e., there exists a regular language containing one of them and disjoint from the other. In particular, if a language, as well as its complement, are both recognized by a WSTS, t...